Algorithms for container loading

The container loading problem consists of packing boxes of various sizes into available containers in a way which optimizes some objective function. The container loading is the core of many problems which arise in distribution and logistics. As the amount of distributed goods grows and with it the need for automation of distribution processes, also the need for computational models and methods for effective container loading increases. In this paper we consider the single container loading problem in which the number of boxes to be packed and the order of packing are known in advance. We give a description of different formulations of the problem as well as an introductory study of methods for its solution. The formulation of the problem also includes aspects often ignored in research literature like rotation of boxes, stability of packing etc. We also give directions for further development to make solution methods applicable in real life.